Path Planning for Indoor Mobile Robot using Half-Sweep SOR via Nine-Point Laplacian (HSSOR9L)
نویسندگان
چکیده
This paper proposed fast Half-Sweep SOR via Nine-Point Laplacian (HSSOR9L) iterative method for solving path planning problem for a mobile robot operating in indoor environment model. It is based on the use of Laplace’s Equation to constraint the distribution of potential values in the environment of the robot. Fast computation with half-sweep iteration is obtained by considering only half of whole points in the configuration model. The inclusion of SOR and 9-point Laplacian into the formulation further speeds up the computation. The simulation results show that HSSOR9L performs much faster than the previous iterative methods in computing the potntial values to be used for generating smooth path from a given initial point to a specified goal position.
منابع مشابه
Path Planning for Mobile Robot using 4EGSOR via Nine-Point Laplacian (4EGSOR9L) Iterative Method
This paper presents an attempt to solve path planning problem for a mobile robot operating in indoor environment model using iterative numerical technique. It is based on the use of Laplace's Equation to compute the potential functions in the environment grid model of the robot. The proposed block iterative method, better known as Four Point-Explicit Group via Nine-Point Laplacian (4EGSOR9...
متن کاملLaplacian Behaviour-Based Control (LBBC) for the Path Planning of Mobile Robot Via Four Point-EGSOR
This paper proposed a behaviour-based paradigm approach known as Laplacian Behaviour-Based Control (LBBC) for solving path planning problem for a mobile robot operating in a structured indoor environment. LBBC relies on the use of Laplace’s Equation to model the potential function in the environment model. For solving the Laplace’s Equation, a numerical technique using a weighted block techniqu...
متن کاملPath Planning for Mobile Robot with Half-sweep Successive Over- Relaxation (hssor) Iterative Method
This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. T...
متن کاملRobotic Motion and Path Planning Via Iterative Method Using Laplacian Technique
The paper deals with Robot motion and path planning programme. The aim of the paper is to develop a path planning programme for mobile robots that is based on laplacian technique using iterative method. One of the most difficult problems in robotics applications is developing robust autonomous motion planning. In order to build a truly autonomous robot, it must have the capability to efficientl...
متن کاملUnification of Artificial Intelligence in Robot Motion and Path Planning Via Laplacian Technique
ABSTRACTThe paper deals with Robot motion and path planning in artificial intelligence. The aim of the paper is to develop a path planning programme for mobile robots that is based on laplacian technique. Robot path planning problem is an important combinational content of artificial intelligence and robotics. Its mission is to be independently movement from the starting point to the target poi...
متن کامل